package com.peng.leetcode.tree;

import java.util.ArrayList;
import java.util.List;

/**
 * IsCompleteTree
 *
 * @author: lupeng6
 * @create: 2021/4/6 20:47
 */
public class IsCompleteTree {

    public static void main(String[] args) {
        TreeNode treeNode = TreeMain.array2tree(new Integer[]{1,2,null,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101});
        System.out.println(new IsCompleteTree().isCompleteTree(treeNode));
    }

    public boolean isCompleteTree(TreeNode root) {
        List<NumNode> nodes = new ArrayList<>();
        nodes.add(new NumNode(root, 1));
        int index = 0;
        while (index < nodes.size()) {
            NumNode numNode = nodes.get(index++);
            if (numNode.node != null) {
                nodes.add(new NumNode(numNode.node.left, numNode.num * 2));
                nodes.add(new NumNode(numNode.node.right, numNode.num * 2 + 1));
            }
        }

        return nodes.get(nodes.size() - 1).num == nodes.size();
    }

    static class NumNode {
        TreeNode node;
        int num;

        public NumNode(TreeNode node, int num) {
            this.node = node;
            this.num = num;
        }
    }

}
